// acwing.895 最长上升子序列LIS
#include<bits/stdc++.h>
using namespace std;


const int N = 1010;
int f[N];
int s[N];
int n;

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> s[i];

    for (int i = 1; i <= n; i++ ) {
        f[i] = 1;
        for (int j = 1; j < i; j++) {
            if (s[i] > s[j]) f[i] = max(f[i], f[j] + 1);
        }
    }
    
    int res = 0;
    for (int i = 1; i <= n; i++) res = max(res, f[i]);
      
    cout << res << endl;
    return 0;
}
